Lattices and Homomorphic Encryption , Spring 2013 Instructors :
نویسندگان
چکیده
• The LWE error distribution Φαq is a continuous one-dimensional Gaussian, which is a projection of the spherical n-dimensional distribution Dαq onto its first coordinate. • The distribution Dαq is smooth in the following sense: If L is some lattice (or coset of a lattice) with λn(L) αq, then if we choose ~x← DL,r and ~y ← Ds such that r2 + s2 = (αq)2 then the induced distribution on ~x+ ~y is close to the continuous distribution Dαq.
منابع مشابه
Classification of Lattice-based Fully Homomorphic Encryption from Noisy Polly Cracker*
Lattices have been used to construct many cryptographic primitives after Ajtai’s seminal paper in 1996. The goal of this paper is to design novel cryptographic primitives using lattices, which are still found to be no polynomial time attack by quantum computers. For achieving this, we survey the known lattice-based cryptography and lattice-based fully homomorphic encryption schemes as a first s...
متن کاملImproved Security for a Ring-Based Fully Homomorphic Encryption Scheme
In 1996, Hoffstein, Pipher and Silverman introduced an efficient lattice based encryption scheme dubbed NTRUEncrypt. Unfortunately, this scheme lacks a proof of security. However, in 2011, Stehlé and Steinfeld showed how to modify NTRUEncrypt to reduce security to standard problems in ideal lattices. In 2012, López-Alt, Tromer and Vaikuntanathan proposed a fully homomorphic scheme based on this...
متن کاملHomomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm to produce a signature on the mean, standard deviation, and other statistics of the signed data. Previous systems for computing on signed data could only handle linear operations. For polynomials of...
متن کاملAn Improvement of Key Generation Algorithm for Gentry's Homomorphic Encryption Scheme
One way of improving efficiency of Gentry’s fully homomorphic encryption from ideal lattices is controlling the number of operations, but our recollection is that any scheme which controls the bound has not proposed. In this paper, we propose a key generation algorithm for Gentry’s scheme that controls the bound of the circuit depth by using the relation between the circuit depth and the eigenv...
متن کاملA Weakly Homomorphic Encryption with LDN
As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their huge key size. In this paper, we present a simple weakly homomorphic encryption scheme using only elementary modular arithmetic over the integers rather than working with ideal lattices. Compared with DGHV’s constr...
متن کامل